Some Spectral Properties of Uniform Hypergraphs

نویسندگان

  • Jiang Zhou
  • Lizhu Sun
  • Wenzhe Wang
  • Changjiang Bu
چکیده

For a k-uniform hypergraph H, we obtain some trace formulas for the Laplacian tensor of H, which imply that ∑n i=1 d s i (s = 1, . . . , k) is determined by the Laplacian spectrum of H, where d1, . . . , dn is the degree sequence of H. Using trace formulas for the Laplacian tensor, we obtain expressions for some coefficients of the Laplacian polynomial of a regular hypergraph. We give some spectral characterizations of oddbipartite hypergraphs, and give a partial answer to a question posed by Shao et al (2014). We also give some spectral properties of power hypergraphs, and show that a conjecture posed by Hu et al (2013) holds under certain conditons.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analytic methods for uniform hypergraphs∗†

This paper presents some analytic methods for studying uniform hypergraphs. Its starting point is the spectral theory of 2-graphs, in particular, the largest and the smallest eigenvalues λ and λmin of 2-graphs. First, these two parameters are extended to weighted uniform hypergraphs; second, the eigenvalues-numbers λ and λmin are extended to eigenvalues-functions λ(p) and λ (p) min, which also ...

متن کامل

Spectra of Uniform Hypergraphs

We present a spectral theory of uniform hypergraphs that closely parallels Spectral Graph Theory. A number of recent developments building upon classical work has led to a rich understanding of “symmetric hyperdeterminants” of hypermatrices, a.k.a. multidimensional arrays. Symmetric hyperdeterminants share many properties with determinants, but the context of multilinear algebra is substantiall...

متن کامل

The extremal spectral radii of k -uniform supertrees

In this paper, we study some extremal problems of three kinds of spectral radii of k-uniform hypergraphs (the adjacency spectral radius, the signless Laplacian spectral radius and the incidence Q-spectral radius). We call a connected and acyclic k-uniform hypergraph a supertree. We introduce the operation of “moving edges” for hypergraphs, together with the two special cases of this operation: ...

متن کامل

Consistency of Spectral Partitioning of Uniform Hypergraphs under Planted Partition Model

Spectral graph partitioning methods have received significant attention from both practitioners and theorists in computer science. Some notable studies have been carried out regarding the behavior of these methods for infinitely large sample size (von Luxburg et al., 2008; Rohe et al., 2011), which provide sufficient confidence to practitioners about the effectiveness of these methods. On the o...

متن کامل

Spectral Extremal Problems for Hypergraphs

In this paper we consider spectral extremal problems for hypergraphs. We give two general criteria under which such results may be deduced from ‘strong stability’ forms of the corresponding (pure) extremal results. These results hold for the α-spectral radius defined using the α-norm for any α > 1; the usual spectral radius is the case α = 2. Our results imply that any hypergraph Turán problem ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2014